//
//  main.cpp
//  GraphTheory
//
//  Created by 刘振舟 on 2024/5/30.
//
#include "StandardTraverse.h"
#include "BreadthFirstSearch.h"
#include "MatrixGraph.h"
#include <iostream>

int main(int argc, const char* argv[]) {
    // insert code here...
    /*BreadthFirstSearchSolution solution;
    char grid_temp[][5] = { {'1', '1', '1', '1', '0'}, {'1', '1', '0', '1', '0'}, {'1', '1', '0', '0', '0'}, {'0', '0', '0', '0', '0'} };
    vector<vector<char>> grid(4, vector<char>(5, '0'));
    for (int i = 0; i < 4; ++i) {
        for (size_t j = 0; j < 5; j++)
        {
            grid[i][j] = grid_temp[i][j];
        }
    }
    cout << solution.numIslands(grid) << endl;*/
    return 0;
}
